<HTML><HEAD><TITLE>ColgenInstance:minimize(+SolveSubProblem, +Obj, -ObjVal)</TITLE>
</HEAD><BODY>[ <A HREF="index.html">library(colgen)</A> | <A HREF="../../index.html">Reference Manual</A> | <A HREF="../../fullindex.html">Alphabetic Index</A> ]
<H1>ColgenInstance:minimize(+SolveSubProblem, +Obj, -ObjVal)</H1>
Minimizes the problem associated with the colgen instance ColgenInstance.
<DL>
<DT><EM>SolveSubProblem</EM></DT>
<DD>Subproblem solution predicate
</DD>
<DT><EM>Obj</EM></DT>
<DD>The objective function to minimize
</DD>
<DT><EM>ObjVal</EM></DT>
<DD>The optimal solution cost
</DD>
</DL>
<H2>Description</H2>
  <P>
  Minimize the partial linear expression <TT>Obj</TT> for the problem
  associated with the colgen instance <TT>ColgenInstance</TT>, using
  the user-defined predicate <TT>SolveSubProblem</TT> to provide
  profitable variables during solution. The optimal solution cost is
  unified with <TT>ObjVal</TT>.
  </P><P>
  The first argument of the subproblem solution predicate must be a
  subproblem structure:
 <PRE>
      sp_prob(master_pool, cutoff, cost, coeff_vars, aux, module)
 </PRE>
  where and <TT>master_pool</TT> will be unified with the colgen
  instance <TT>ColgenInstance</TT> so that solutions can be posted to
  it from within the solution predicate, <TT>cutoff</TT> is a minimum
  acceptable value for the cost of subproblem solutions that will be
  updated before calling the predicate, <TT>cost</TT> is the variable
  occurring in the implicit sum term of <TT>obj</TT> (if any)
  representing the contribution of new subproblem solutions to the
  master problem solution cost, <TT>coeff_vars</TT> is a list of all
  subproblem variables occurring in the implicit sum terms of master
  problem constraints, and <TT>module</TT> is the module in which the
  solution predicate should be called.
  </P>
  

</BODY></HTML>
